Clustering by Low-Rank Doubly Stochastic Matrix Decomposition

نویسندگان

  • Zhirong Yang
  • Erkki Oja
چکیده

1 Data Sources • Amazon abbreviates the AmazonBinary dataset in Chen’s collection. • Iris is from the UCI machine learning repository . • Votes is from the UCI machine learning repository . • ORL is from the Database of Faces of AT&T. • PIE is from CMU/VASC Image Database. • YaleB is from the Extended Yale Face Database B. • COIL20 is from Columbia University Image Library. • Isolet is from the UCI machine learning repository . • Mfeat is from the UCI machine learning repository . • Webkb4 is the 4 Universities Data Set from CMU . • 7sectors is from CMU World Wide Knowledge Base project. • USPS is from the UCI machine learning repository . • PenDigits is from the UCI machine learning repository . • LetReco abbreviates the Letter Recogonition dataset from the UCI machine learning repository . • MNIST is from the MNIST database.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-Rank Doubly Stochastic Matrix Decomposition for Cluster Analysis

Cluster analysis by nonnegative low-rank approximations has experienced a remarkable progress in the past decade. However, the majority of such approximation approaches are still restricted to nonnegative matrix factorization (NMF) and suffer from the following two drawbacks: 1) they are unable to produce balanced partitions for large-scale manifold data which are common in real-world clusterin...

متن کامل

Improving cluster analysis by co-initializations

Many modern clustering methods employ a non-convex objective function and use iterative optimization algorithms to find local minima. Thus initialization of the algorithms is very important. Conventionally the starting guess of the iterations is randomly chosen; however, such a simple initialization often leads to poor clusterings. Here we propose a new method to improve cluster analysis by com...

متن کامل

Clustered low rank approximation of graphs in information science applications

In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and then approximates each cluster separately using existing methods, e.g. the singular value decomposition, or stochastic algorithms. The cluster-wise approximations are then extended to approximate the entire graph. Thi...

متن کامل

Robust Multi-View Spectral Clustering via Low-Rank and Sparse Decomposition

Multi-view clustering, which seeks a partition of the data in multiple views that often provide complementary information to each other, has received considerable attention in recent years. In real life clustering problems, the data in each view may have considerable noise. However, existing clustering methods blindly combine the information from multi-view data with possibly considerable noise...

متن کامل

Fast and Accurate Low Rank Approximation of Massive Graphs

In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and then approximating each cluster separately using existing methods, e.g. the singular value decomposition, or stochastic algorithms. The cluster-wise approximations are then extended to approximate the entire graph. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1206.4676  شماره 

صفحات  -

تاریخ انتشار 2012